Models of computation for partial functions on the reals
نویسندگان
چکیده
Article history: Received 20 November 2012 Received in revised form 3 November 2014 Accepted 3 November 2014 Available online 12 November 2014
منابع مشابه
A new approach to using the cubic B-spline functions to solve the Black-Scholes equation
Nowadays, options are common financial derivatives. For this reason, by increase of applications for these financial derivatives, the problem of options pricing is one of the most important economic issues. With the development of stochastic models, the need for randomly computational methods caused the generation of a new field called financial engineering. In the financial engineering the pre...
متن کاملAnalog computers and recursive functions over the reals
In this paper we show that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene’s classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these models have drawbacks and we introduce an alternative continuous-time model of computation that solve...
متن کاملModèles de calcul sur les réels, résultats de comparaison. (Computation on the reals.Comparison of some models)
Computation on the real numbers can be modelised in several different ways. Thereindeed exist a lot of different computation models on the reals. However, there existfew results for comparing those models, and most of these results are incomparabilityresults. The case of computation over the real numbers hence is quite different fromthat of computation over integer numbers where...
متن کاملGeneralizing Computability Theory to Abstract Algebras
We present a survey of our work over the last few decades on generalizations of computability theory to many-sorted algebras. The following topics are discussed, among others: (1) abstract v concrete models of computation for such algebras; (2) computability and continuity, and the use of many-sorted topological partial algebras, containing the reals; (3) comparisons between various equivalent ...
متن کاملAbout and around Computing over the Reals
Computation Procedures • Abstract Computation Procedures (ACPs), (Feferman 1992); should have been called Abstract Recursion Procedures. • Here structures are specified by (possibly) manysorted domains, individual constants, partial functions, and partial monotonic functionals of type level 2. ACP Computable Functions and Functionals • The ACP schemata are given by Explicit Definition in type l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Algebr. Meth. Program.
دوره 84 شماره
صفحات -
تاریخ انتشار 2015